Computing the Diameter of 17-Pancake Graph Using a PC Cluster
نویسندگان
چکیده
An n-pancake graph is a graph whose vertices are the permutations of n symbols and each pair of vertices are connected with an edge if and only if the corresponding permutations can be transitive by a prefix reversal. Since the n-pancake graph has n! vertices, it is known to be a hard problem to compute its diameter by using an algorithm with the polynomial order of the number of vertices. Fundamental approaches of the diameter computation have been proposed. However, the computation of the diameter of 15-pancake graph has been the limit in practice. In order to compute the diameters of the larger pancake graphs, it is indispensable to establish a sustainable parallel system with enough scalability. Therefore, in this study, we have proposed an improved algorithm to compute the diameter and have developed a sustainable parallel system with the Condor/MW framework, and computed the diameters of 16and 17-pancake graphs by using PC clusters.
منابع مشابه
On the genus of pancake network
Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compared to hypercubes. In this paper, we focus on another important property, namely the genus. The genus of a graph is the minimum number of handles needed for drawing the graph on the plane without edges crossing. We will...
متن کاملCluster Fault-tolerant Routing in Pancake Graphs
In this paper, we propose an O(n) algorithm that finds a fault-free path between any pair of non-faulty nodes in an n-pancake graph with n−2 faulty clusters whose diameters are at most 2. The lengths of the paths obtained by our algorithm are at most d◦(Pn)+7 where d◦(Pn) = b5(n+1)/3c represents the upper bound of the diameter of Pn given by Gates and Papadimitriou. According to the computer ex...
متن کاملFault-tolerant routing in burnt pancake graphs
Recently, researches of parallel distributed computation are getting more important. Especially, massively parallel systems are studied with enthusiasm, and many topologies have been proposed. Since multiple faulty elements are expected in a massively parallel system, fault-tolerant routing is also studied eagerly for communication avoiding the faulty elements [4,6,8]. In this study, we focus o...
متن کاملA Parallel Algorithm for Interpolation in Pancake Graph
In this paper a parallel algorithm for Lagrange interpolation is applied on a n-pancake graph. The npancake graph is a Cayley graph with N=n! vertices and with attractive properties regarding degree, diameter, symmetry, embeddings and self similarity. Using these properties the algorithm carries the calculation in O(N) steps of communication and arithmetic operations instead of O(N) steps for a...
متن کاملSome relations on prefix reversal generators of the symmetric and hyperoctahedral group
The pancake problem is concerned with sorting a permutation (a stack of pancakes of different diameter) using only prefix reversals (spatula flips). Although the problem description belies simplicity, an exact formula for the maximum number of flips needed to sort $n$ pancakes has been elusive. In this paper we present a different approach to the pancake problem, as a word problem on the symmet...
متن کامل